Local stability properties of complex, species‐rich soil food webs with functional block structure

Ecologists have long debated the properties that confer stability to complex, species-rich ecological networks. Species-level soil food webs are large and structured networks of central importance to ecosystem functioning. Here, we conducted an analysis of the stability properties of an up-to-date set of theoretical soil food web models that account both for realistic levels of species richness and the most recent views on the topological structure (who is connected to whom) of these food webs. The stability of the network was best explained by two factors: strong correlations between interaction strengths and the blocked, nonrandom trophic structure of the web. These two factors could stabilize our model food webs even at the high levels of species richness that are typically found in soil, and that would make random systems very unstable. Also, the stability of our soil food webs is well-approximated by the cascade model. This result suggests that stability could emerge from the hierarchical structure of the functional organization of the web. Our study shows that under the assumption of equilibrium and small perturbations, theoretical soil food webs possess a topological structure that allows them to be complex yet more locally stable than their random counterpart. In particular, results strongly support the general hypothesis that the stability of rich and complex soil food webs is mostly driven by correlations in interaction strength and the organization of the soil food web into functional groups. The implication is that in real-world food web, any force disrupting the functional structure and distribution pattern of interaction strengths (i.e., energy fluxes) of the soil food webs will destabilize the dynamics of the system, leading to species extinction and major changes in the relative abundances of species.Theoretical Physic

Size Doesn't Matter: Towards a More Inclusive Philosophy of Biology

notes: As the primary author, O’Malley drafted the paper, and gathered and analysed data (scientific papers and talks). Conceptual analysis was conducted by both authors.publication-status: Publishedtypes: ArticlePhilosophers of biology, along with everyone else, generally perceive life to fall into two broad categories, the microbes and macrobes, and then pay most of their attention to the latter. ‘Macrobe’ is the word we propose for larger life forms, and we use it as part of an argument for microbial equality. We suggest that taking more notice of microbes – the dominant life form on the planet, both now and throughout evolutionary history – will transform some of the philosophy of biology’s standard ideas on ontology, evolution, taxonomy and biodiversity. We set out a number of recent developments in microbiology – including biofilm formation, chemotaxis, quorum sensing and gene transfer – that highlight microbial capacities for cooperation and communication and break down conventional thinking that microbes are solely or primarily single-celled organisms. These insights also bring new perspectives to the levels of selection debate, as well as to discussions of the evolution and nature of multicellularity, and to neo-Darwinian understandings of evolutionary mechanisms. We show how these revisions lead to further complications for microbial classification and the philosophies of systematics and biodiversity. Incorporating microbial insights into the philosophy of biology will challenge many of its assumptions, but also give greater scope and depth to its investigations

Bosschere. Object-relative addressing: Compressed pointers in 64-bit java virtual machines

Abstract. 64-bit address spaces come at the price of pointers requiring twice as much memory as 32-bit address spaces, resulting in increased memory usage. This paper reduces the memory usage of 64-bit pointers in the context of Java virtual machines through pointer compression, called Object-Relative Addressing (ORA). The idea is to compress 64-bit raw pointers into 32-bit offsets relative to the referencing object’s virtual address. Unlike previous work on the subject using a constant base address for compressed pointers, ORA allows for applying pointer compression to Java programs that allocate more than 4GB of memory. Our experimental results using Jikes RVM and the SPECjbb and DaCapo benchmarks on an IBM POWER4 machine show that the overhead introduced by ORA is statistically insignificant on average compared to raw 64-bit pointer representation, while reducing the total memory usage by 10 % on average and up to 14.5 % for some applications.